منابع مشابه
One-Probe Search
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1− , and otherwise returns “don’t know”. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown t...
متن کاملBeyond Search: A Technology Probe Investigation
This paper reports on the use of two probes to investigate what might be user activities that go beyond search as traditionally conceived. In particular, it reviews the state of play for user experience with search engines, the form of web use more generally, and then describes the design of Cards and Pebbles, two search engine-based probes developed to help elicit new concepts for web based ex...
متن کاملBeyond Search: A Technology Probe Investigation
This paper reports on the use of two probes to investigate what might be user activities that go beyond search as traditionally conceived. In particular, it reviews the state of play for user experience with search engines, the form of web use more generally, and then describes the design of Cards and Pebbles, two search engine-based probes developed to help elicit new concepts for web based ex...
متن کاملPlagiarism Search within One Document
This paper is a usability study of a plagiarism search method proposed by Csernoch Mária at the II. Hungarian Computer Linguistics Conference. The method promises to be able to detect plagiarism is a document based on the change in style between di erent parts of the document.
متن کاملEnhancing Finite Set Constraint Programming with Probe Backtrack Search
Finite Set constraint programming (FS) offers a very expressive language to formalize combinatorial problems. The primitives of FS are set variables and relations (e.g. subset, intersection, union, ...). Usually, finite set constraint systems have also syntactic abstractions for n− ary set relations, such as partition([S1 . . . Sn],M), which forces the n set variables to be pairwise disjoint an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2002
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v9i9.21727